Parallel Implementation of a Two-level Algebraic ILU(k)-based Domain Decomposition Preconditioner

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods

We present a new parallelizable preconditioner that is used as the local component for a two-level preconditioner similar to BPS. On 2D model problems that exhibit either high anisotropy or discontinuity, we demonstrate its attracting numerical behaviour and compare it to the regular BPS. Finally, to alleviate the construction cost of this new preconditioner, that requires the explicit computat...

متن کامل

A Two-Level Parallel Preconditioner Based on Sparse Approximate Inverses

We introduce a novel strategy for parallel preconditioning of large-scale linear systems by means of a two-level factorized sparse approximate inverse algorithm. Using graph partitioning and incomplete biconjugation we are able to obtain a highly parallel preconditioner. The algorithm has been implemented using MPI on a SGI Origin 2000 computer at Los Alamos National Laboratory and is currently...

متن کامل

Parallel Implementation of a Schwarz Domain Decomposition Algorithm

We describe and compare some recent domain decomposition algorithms of Schwarz type with respect to parallel performance. A new, robust domain decomposition algorithm { Additive Average Schwarz is compared with a classical overlapping Schwarz code. Complexity estimates are given in both two and three dimensions and actual implementations are compared on a Paragon machine as well as on a cluster...

متن کامل

Analysis of Two-level Domain Decomposition Preconditioners Based on Aggregation

In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tema (São Carlos)

سال: 2018

ISSN: 2179-8451,1677-1966

DOI: 10.5540/tema.2018.019.01.59